Domination and Kwapień’s factorization theorems for positive Cohen p–nuclear m–linear operators
نویسندگان
چکیده
منابع مشابه
Domination by Positive Disjointly Strictly Singular Operators
We prove that each positive operator from a Banach lattice E to a Banach lattice F with a disjointly strictly singular majorant is itself disjointly strictly singular provided the norm on F is order continuous. We prove as well that if S : E → E is dominated by a disjointly strictly singular operator, then S2 is disjointly strictly singular.
متن کاملSpelling theorems and Cohen-Lyndon theorems for one-relator products *
Duncan, A.J. and J. Howie, Spelling theorems and Cohen-Lyndon theorems for one-relator products, Journal of Pure and Applied Algebra 92 (1994) 123-136. Spelling theorems, a Cohen-Lyndon theorem and a Magnus theorem are proved for onerelator products of arbitrary groups, in cases where the relator is a sufficiently high power.
متن کاملFrom torsion theories to closure operators and factorization systems
Torsion theories are here extended to categories equipped with an ideal of 'null morphisms', or equivalently a full subcategory of 'null objects'. Instances of this extension include closure operators viewed as generalised torsion theories in a 'category of pairs', and factorization systems viewed as torsion theories in a category of morphisms. The first point has essentially been treated in [15].
متن کاملKorovkin-type Theorems and Approximation by Positive Linear Operators
This survey paper contains a detailed self-contained introduction to Korovkin-type theorems and to some of their applications concerning the approximation of continuous functions as well as of L-functions, by means of positive linear operators. The paper also contains several new results and applications. Moreover, the organization of the subject follows a simple and direct approach which quick...
متن کاملGallai Theorems Involving Domination Parameters
In 1959 Gallai [5] showed that the vertex independence number and the vertex covering number of a graph G = (V,E) sum to |V |. Over the last twenty years, many results similar to Gallai’s Theorem have been observed [3]. These theorems are referred to as “Gallai Theorems” and usually have the form: α+ β = n. Slater [17] described several graph subset parameters using linear programs (LP) and int...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Moroccan Journal of Pure and Applied Analysis
سال: 2020
ISSN: 2351-8227
DOI: 10.2478/mjpaa-2021-0010